A Neyman–Pearson Approach to Universal Erasure and List Decoding
نویسندگان
چکیده
منابع مشابه
A general approach to list decoding
In [1] we derived one shot achievable and converse bounds with possible mismatched decoding. In this paper, we extend the results to the list decoding case.
متن کاملA behavioral approach to list decoding
List decoding may be translated into a bivariate interpolation problem. The interpolation problem is to find a bivariate polynomial of minimal weighted degree that interpolates a given set of pairs taken from a finite field. We present a behavioral approach to this interpolation problem. With the data points we associate a set of trajectories. For this set of trajectories we construct the Most ...
متن کاملOn Optimal Erasure and List Decoding Schemes of Convolutional Codes
A modified Viterbi algorithm with erasures and list-decoding is introduced. This algorithm is shown to yield the optimal decoding rule of Forney with erasures and variable list-size. For the case of decoding with erasures, the optimal algorithm is compared to the simple algorithm of Yamamoto and Itoh. The comparison shows a remarkable similarity in simulated performance, but with a considerably...
متن کاملFixed Error Asymptotics For Erasure and List Decoding
We derive the optimum second-order coding rates, known as second-order capacities, for erasure and list decoding. For erasure decoding for discrete memoryless channels, we show that second-order capacity is √ V Φ−1( t) where V is the channel dispersion and t is the total error probability, i.e., the sum of the erasure and undetected errors. We show numerically that the expected rate at finite b...
متن کاملA Factor-Graph Approach to Universal Decoding
We consider data communication over a discrete memoryless channel where neither the sender nor the receiver knows the channel law. The setup is universal in the sense that no training sequence is allowed, i.e. no position of the channel code is allowed to be fixed to a certain symbol. We discuss a variety of approaches for solving this problem efficiently. It turns out that it is worthwhile to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2009
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2009.2027569